منابع مشابه
Probabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocols require n ≥ 5b + 1 servers (where b is the maximum number of faults tolerated), owing to their use of opaque Byzantine quorum systems; this is 2b more servers than required by some non-optimistic protocols. In this ...
متن کاملWrite Markers for Probabilistic Quorum Systems
Probabilistic quorum systems can tolerate a larger fraction of faults than can traditional (strict) quorum systems, while guaranteeing consistency with an arbitrarily high probability for a system with enough replicas. However, they are hampered in that, like strict quorum systems, they allow for Byzantine-faulty servers to collude maximally to provide incorrect values to clients. We present a ...
متن کاملProbabilistic Quorum-Based Accounting for Peer-to-Peer Systems
Providing an effective accounting scheme for decentralized peer-to-peer systems is difficult without relying on a central server or peers with special trusted status. In this paper, we present Probabilistic Quorum-based Accounting (PQA) for peer-to-peer systems. In our approach, a peer receiving a request will retrieve resource usage accounting information about the requesting peer from a quoru...
متن کاملProbabilistic quorum systems for dependable distributed data management
Among failure-prone and dynamic distributed systems there is a significant class of systems that strive for high availability and can function with inconsistent data. Examples include flight reservation systems which allow overbooking or emergency ambulance systems which return informative responses to time-critical queries. Data replication is a well-known technique for tolerating failures and...
متن کاملA Distributed Algorithm for Resource Allocation with Probabilistic Quorum Systems
The resource allocation problem is one of fundamental problems in distributed systems, and many resource models and resource allocation algorithms have been proposed in many literature. In this paper, we consider a problem of allocating a set of unnamed resources that can be overbooked. Such a resource model is suitable for sharing broadband communication channel by many nodes. We propose a ran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2001
ISSN: 0890-5401
DOI: 10.1006/inco.2001.3054